The Page-Rényi Parking Process
نویسندگان
چکیده
منابع مشابه
The Page-Rényi Parking Process
In the Page parking (or packing) model on a discrete interval (also known as the discrete Rényi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places, until only isolated places remain. We use a probabilistic construction of the Page parking to give a short proof of the (known) fact that the proportion of the int...
متن کاملParking Emergency Parking Permit Parking Courtesy
MAIN CAMPUS PHONE NUMBERS AREA CODE: 949 Information Operator (8 a.m.-5 p.m., Mon.-Fri.) 824-5011 Admissions & Relations with Schools/Undergraduate 824-6703 Alumni Association 824-ALUM (2586) Applied Innovation 824-COVE (2683) Arts Box Office 824-ARTS (2787) Athletics 824-6931 Bookstore (The Hill) 824-BOOK (2665) Bren Events Center Ticket Office 824-5000 Campus Recreation 824-5346 Career Center...
متن کاملOn Page-based Optimistic Process Checkpointing
Persistent object systems must provide some form of checkpointing to ensure that changes to persistent data are secured on non-volatile storage. When processes share or exchange modified data, mechanisms must be provided to ensure that they may be consistently checkpointed. This may be performed eagerly by synchronously checkpointing all dependent data. Alternatively, optimistic techniques may ...
متن کاملInternet of Things Based Process Model for Smart Parking System
Transportation is an essential need for many people to go to their work, school, and home. In particular, the main common method inside many cities is to drive the car. Driving a car can be an easy job to reach the destination and load all stuff in a reasonable time. However, deciding to find a parking lot for a car can take a long time using the traditional system that can issue a paper ticket...
متن کاملA Binomial Splitting Process in Connection with Corner Parking Problems
A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The later also has natural interpretations in terms of distinct values in iid geometric random variables and the occupancy problem in urn models. The corresponding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2015
ISSN: 1077-8926
DOI: 10.37236/5150